Signed degree sequences of signed graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Signed Degree Sequences in Signed Bipartite Graphs

A signed bipartite graph is a bipartite graph in which each edge is assigned a positive or a negative sign. Let G(U, V ) be a signed bipartite graph with U = {u1, u2, · · · , up} and V = {v1, v2, · · · , vq} . Then signed degree of ui is sdeg(ui) = di = d + i − d − i , where 1 ≤ i ≤ p and d+i ( d − i ) is the number of positive(negative) edges incident with ui , and signed degree of vj is sdeg(...

متن کامل

Signed degree sequences in signed multipartite graphs

A signed k-partite graph (signed multipartite graph) is a k-partite graph in which each edge is assigned a positive or a negative sign. If G(V1, V2, · · · , Vk) is a signed k-partite graph with Vi = {vi1, vi2, · · · , vini}, 1 ≤ i ≤ k, the signed degree of vij is sdeg(vij) = dij = d + ij − d − ij , where 1 ≤ i ≤ k, 1 ≤ j ≤ ni and d + ij(d − ij) is the number of positive (negative) edges inciden...

متن کامل

Signed degree sets in signed bipartite graphs

A signed bipartite graph G(U, V) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V) is the number of positive edges incident with x less the number of negative edges incident with x. The set S of distinct signed degrees of the vertices of G(U, V) is called its signed degree set. In this paper, we prove that every set of ...

متن کامل

A Note on Signed Degree Sets in Signed Bipartite Graphs

A signed bipartite graph G(U, V ) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V ) is the number of positive edges incident with x less the number of negative edges incident with x. The set S of distinct signed degrees of the vertices of G(U, V ) is called its signed degree set. In this paper, we prove that every set ...

متن کامل

On net-Laplacian Energy of Signed Graphs

A signed graph is a graph where the edges are assigned either positive ornegative signs. Net degree of a signed graph is the dierence between the number ofpositive and negative edges incident with a vertex. It is said to be net-regular if all itsvertices have the same net-degree. Laplacian energy of a signed graph is defined asε(L(Σ)) =|γ_1-(2m)/n|+...+|γ_n-(2m)/n| where γ_1,...,γ_n are the ei...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Graph Theory

سال: 1997

ISSN: 0364-9024,1097-0118

DOI: 10.1002/(sici)1097-0118(199710)26:2<111::aid-jgt6>3.0.co;2-v